Petri nets and bisimulation
نویسندگان
چکیده
منابع مشابه
Petri nets and resource bisimulation
Resources are defined as submultisets of Petri net markings. Two resources are called similar if replacing one of them by another in any marking doesn’t change the Petri net’s behavior. We define the relations of resource similarity and resource bisimulation and show that they are finitely based. In this paper the resource bisimulation is studied for different classes of Petri nets: ordinary Pe...
متن کاملBisimulation and the Reduction of Petri Nets
We investigate structural equivalences on places of P/T nets that allow reductions compatible with bisimilarity. This comes with a study of two kinds of reductions: fusion of equivalent places, and replacement of some places by other ones. When eeectivity issues are considered, we are lead to a variant of place bisimulation that takes into account a set of \relevant" markings.
متن کاملHomology and Bisimulation of Asynchronous Transition Systems and Petri Nets
Homology groups of labelled asynchronous transition systems and Petri nets are introduced. Examples of computing the homology groups are given. It is proved that if labelled asynchronous transition systems are bisimulation equivalent, then they have isomorphic homology groups. A method of constructing a Petri net with given homology groups is found. 2000 Mathematics Subject Classification 18G35...
متن کاملBisimulation Relations Between Automata, Stochastic Differential Equations and Petri Nets
Two formal stochastic models are said to be bisimilar if their solutions as a stochastic process are probabilistically equivalent. Bisimilarity between two stochastic model formalisms means that the strengths of one stochastic model formalism can be used by the other stochastic model formalism. The aim of this paper is to explain bisimilarity relations between stochastic hybrid automata, stocha...
متن کاملSaturation Heuristic for Faster Bisimulation with Petri Nets
Bisimilarity is an extensional notion of equivalence of states of an automata. A bisimulation is a set of such equivalences among the states of automata. The bisimulation problem is the task of deciding bisimilarity for all pairs of states of an automata. The present work applies the Saturation [15] heuristic and interleaved MDD partition representation to the bisimulation problem. Previous wor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00122-0